Search results for " rando"
showing 10 items of 498 documents
Adjacency matrices of random digraphs: singularity and anti-concentration
2017
Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …
How much is enough? : The convergence of finite sample scattering properties to those of infinite media
2021
We study the scattering properties of a cloud of particles. The particles are spherical, close to the incident wavelength in size, have a high albedo, and are randomly packed to 20% volume density. We show, using both numerically exact methods for solving the Maxwell equations and radiative-transfer-approximation methods, that the scattering properties of the cloud converge after about ten million particles in the system. After that, the backward-scattered properties of the system should estimate the properties of a macroscopic, practically infinite system. (C) 2021 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.o…
Stochastic models for phytoplankton dynamics in Mediterranean Sea
2016
Abstract In this paper, we review some results obtained from three one-dimensional stochastic models, which were used to analyze picophytoplankton dynamics in two sites of the Mediterranean Sea. Firstly, we present a stochastic advection–reaction–diffusion model to describe the vertical spatial distribution of picoeukaryotes in a site of the Sicily Channel. The second model, which is an extended version of the first one, is used to obtain the vertical stationary profiles of two groups of picophytoplankton, i.e. Pelagophytes and Prochlorococcus, in the same marine site as in the previous case. Here, we include intraspecific competition of picophytoplanktonic groups for limiting factors, i.e.…
A Methodology to Derive Global Maps of Leaf Traits Using Remote Sensing and Climate Data
2018
This paper introduces a modular processing chain to derive global high-resolution maps of leaf traits. In particular, we present global maps at 500 m resolution of specific leaf area, leaf dry matter content, leaf nitrogen and phosphorus content per dry mass, and leaf nitrogen/phosphorus ratio. The processing chain exploits machine learning techniques along with optical remote sensing data (MODIS/Landsat) and climate data for gap filling and up-scaling of in-situ measured leaf traits. The chain first uses random forests regression with surrogates to fill gaps in the database (> 45% of missing entries) and maximizes the global representativeness of the trait dataset. Plant species are then a…
Do carotenoid-based sexual traits signal the availability of non-pigmentary antioxidants?
2006
SUMMARY Carotenoid-based signals are thought to be indicators of male quality because they must be obtained from the diet and might thus indicate the ability of individuals to gather high-quality food. However, carotenoids are also known to have important physiological functions as immunoenhancers and antioxidants, and, as such, carotenoid-based sexual traits have also been suggested to reflect the health and antioxidant status of their bearers. This last idea is based on the hypothesis that carotenoids that are allocated to sexual signals are no longer available for the detoxification system. Recently, this hypothesis has been challenged on the grounds that the antioxidant activity is not …
Hierarchical log Gaussian Cox process for regeneration in uneven-aged forests
2021
We propose a hierarchical log Gaussian Cox process (LGCP) for point patterns, where a set of points x affects another set of points y but not vice versa. We use the model to investigate the effect of large trees to the locations of seedlings. In the model, every point in x has a parametric influence kernel or signal, which together form an influence field. Conditionally on the parameters, the influence field acts as a spatial covariate in the intensity of the model, and the intensity itself is a non-linear function of the parameters. Points outside the observation window may affect the influence field inside the window. We propose an edge correction to account for this missing data. The par…
A laplace type problem for three lattices with non-convex cell
2016
In this paper we consider three lattices with cells represented in Fig. 1, 3 and 5 and we determine the probability that a random segment of constant length intersects a side of lattice. c ⃝2016 All rights reserved.
A Hierarchical Learning Scheme for Solving the Stochastic Point Location Problem
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_78 This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task of a Learning Mechanism attempting to locate a point on a line. The mechanism interacts with a random environment which essentially informs it, possibly erroneously, if the unknown parameter is on the left or the right of a given point which also is the current guess. The first pioneering work […
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
Évaluation de l’impact de l’intervention d’un travailleur social auprès d’aidants informels de personnes âgées atteintes d’une pathologie chronique. …
2018
Introduction L’amelioration des conditions de vie et les progres medicaux ont permis un allongement de la duree de vie a des âges tres eleves, lequel a genere l’apparition et le developpement de maladies chroniques associees a des comorbidites. Dans ce contexte, la problematique de la dependance est devenue un enjeu majeur pour les politiques publiques. Depuis de nombreuses annees, elles traduisent leur volonte de faciliter le maintien au domicile le plus longtemps possible a des personnes âgees en perte d’autonomie. Ainsi, cette volonte de continuer a vivre a domicile, directement exprimee par les aines, repose en grande partie sur un reseau d’aides informelles (famille, amis, voisins). Le…